Learning tree languages from text

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Tree Languages from Text

We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Science, 290:1679–1711, 2003, can be generalized from the case of string languages towards tree languages. This provides a large source of identifiable classes of regular tree languages. Each of these classes can be char...

متن کامل

Learning Rational Stochastic Tree Languages

We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T (F), from a sample of trees independently drawn according to an unknown target P . We consider the case where the target is a rational stochastic tree language, i.e. it can be computed by a rational tree series or, equivalently, by a multiplicity tree automaton. In this paper, we ...

متن کامل

Learning Regular Tree Languages from Correction and Equivalence Queries

Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakibara’s work, we introduce the algorithm LRTLC and we show that regular tree languages are learnable from equivalence and correction queries when the set of contexts is ordered by a Knuth-Bendix order. Moreover, a subclass...

متن کامل

Learning Tree Languages from Positive Examples and Membership Queries

One of the most astonishing discovery of Chomsky [13] is the universal grammar which is a model of how human language works. The universal grammar is an innate combinatorial system from which every language, French, English, Japanese, can be derived. What is the implication of Chomsky’s universal grammar for grammatical inference? We think it gives a strong intuition for the mathematical modeli...

متن کامل

MMDT: Multi-Objective Memetic Rule Learning from Decision Tree

In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 2007

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita:2007030